Enhancing large neighbourhood search heuristics for Benders’ decomposition
نویسندگان
چکیده
Abstract A general enhancement of the Benders’ decomposition (BD) algorithm can be achieved through improved use large neighbourhood search heuristics within mixed-integer programming solvers. While solvers are endowed with an array heuristics, few, if any, have been designed for BD. Further, typically is limited to finding solutions BD master problem. Given lack frameworks BD, only ad hoc approaches developed enhance ability find high quality primal feasible heuristics. The framework SCIP has extended a trust region based heuristic and employs solve auxiliary problems all improve identified solutions. computational results demonstrate that technique accelerate improvement in bound when applying
منابع مشابه
Search Heuristics for Box Decomposition Methods
In this paper we study search heuristics for box decomposition methods that solve problems such as global optimization, minimax optimization, or quantified constraint solving. For this we unify these methods under a branch-and-bound framework, and develop a model that is more convenient for studying heuristics for such algorithms than the traditional models from Artificial Intelligence. We use ...
متن کاملBenders Decomposition for Large-Scale Uncapacitated Hub Location
This paper describes an exact algorithm capable of solving large-scale instances of an important hub location problem called the Uncapacitated Hub Location Problem with Multiple Assignments. The algorithm applies Benders decomposition to a strong path-based formulation of the problem. The standard decomposition algorithm is enhanced through the inclusion of several features such as the use of a...
متن کاملRedesigning Benders Decomposition for Large-Scale Facility Location
The Uncapacitated Facility Location (UFL) problem is one of the most famous and most studied problems in the Operations Research literature. Given a set of potential facility locations, and a set of customers, the goal is to find a subset of facility locations to open, and to allocate each customer to open facilities, so that the facility opening plus customer allocation costs are minimized. In...
متن کاملLogic-Based Benders Decomposition
Benders decomposition uses a strategy of “learning from one’s mistakes.” The aim of this paper is to extend this strategy to a much larger class of problems. The key is to generalize the linear programming dual used in the classical method to an “inference dual.” Solution of the inference dual takes the form of a logical deduction that yields Benders cuts. The dual is therefore very different f...
متن کاملGeneric Adaptive Heuristics for Large Neighborhood Search
The Large Neighborhood Search (LNS) approach for solving Constrained Optimization Problems has been proved to be effective on a wide range of problems. LNS is a local search metaheuristic that uses a complete search method (such as CP) to explore a large neighborhood. At each step, the neighborhood is defined by relaxing a subset, called fragment, of the variables in the current solution. Despi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Heuristics
سال: 2021
ISSN: ['1572-9397', '1381-1231']
DOI: https://doi.org/10.1007/s10732-021-09467-z